Implementation of a new primality test
نویسندگان
چکیده
منابع مشابه
Implementation of a New Primality Test
An implementation of the Cohen-Lenstra version of the Adleman-Pomerance-Rumely primality test is presented. Primality of prime numbers of up to 213 decimal digits can now routinely be proved within approximately ten minutes. Introduction. In [2] a theoretically and algorithmically simplified version of the Adleman-Pomerance-Rumely primality testing algorithm [1] was presented. To prove its prac...
متن کاملA Potentially Fast Primality Test
The running time is O(r log n). It can be shown by elementary means that the required r exists in O(log n). So the running time is O(log n). Moreover, by Fouvry’s Theorem [8], such r exists in O(log n), so the running time becomes O(log n). In [10], Lenstra and Pomerance showed that the AKS primality test can be improved by replacing the polynomial x − 1 in equation (1.1) with a specially const...
متن کاملMiller's Primality Test
Primality test, prime In this paper we prove the following simplification of Miller's primality criterion [2]. Theorem 1. Assume that for every integer d that is 1 mod 4 and either prime or the product of two primes, the L-function I= & (k/d) l kmS satisfies the generalized Riemann hypothesis, where {kid) denotes the Jacobi symbol, defined below. Let n be an odd integer, n > I , and write n-I-=...
متن کاملBiquadratic reciprocity and a Lucasian primality test
Let {sk, k ≥ 0} be the sequence defined from a given initial value, the seed, s0, by the recurrence sk+1 = s 2 k − 2, k ≥ 0. Then, for a suitable seed s0, the number Mh,n = h · 2n − 1 (where h < 2n is odd) is prime iff sn−2 ≡ 0 mod Mh,n. In general s0 depends both on h and on n. We describe a slight modification of this test which determines primality of numbers h·2n±1 with a seed which depends...
متن کاملA Simpli ed Quadratic Frobenius Primality Test
The publication of the quadratic Frobenius primality test [6] has stimulated a lot of research, see e.g. [4, 10, 11]. In this test as well as in the Miller-Rabin test [13], a composite number may be declared as probably prime. Repeating several tests decreases that error probability. While most of the above research papers focus on minimising the error probability as a function of the number of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 1987
ISSN: 0025-5718
DOI: 10.1090/s0025-5718-1987-0866102-2